The Strictly Efficient Subgradient of Set-Valued Optimisation
نویسندگان
چکیده
منابع مشابه
Optimality Conditions for Vector Optimisation with Set-valued Maps
In recent years, vector optimisation with set-valued maps in infinite dimensional spaces has been received an increasing amount of attention. See [6, 2, 5, 8, 4, 9] and references therein, for its extensive applications in many fields such as mathematical programming, optimal control, management science. Vector optimisation with setvalued maps, sometimes called set-valued vector optimisation fo...
متن کاملStructure of the Fixed Point of Condensing Set-Valued Maps
In this paper, we present structure of the fixed point set results for condensing set-valued map. Also, we prove a generalization of the Krasnosel'skii-Perov connectedness principle to the case of condensing set-valued maps.
متن کاملProjected subgradient method for non - Lipschitz set - valued mixed variational inequalities
A projected subgradient method for solving a class of set-valued mixed variational inequalities (SMVIs) is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.
متن کاملOn Strictly Nonzero Integer-valued Charges
A charge (finitely additive measure) defined on a Boolean algebra of sets taking values in a group G is called a strictly nonzero (SNZ) charge if it takes the identity value in G only for the zero element of the Boolean algebra. A study of such charges was initiated by Rudiger Göbel and KPS Bhaskara Rao in 2002 [3]. Our main result is a solution to one of the questions posed in that paper: we s...
متن کاملOptimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
In this paper, we present a new approach to the study of various efficient solutions of a set-valued equilibrium problem (for short, SEP) through the study of corresponding solutions of a set-valued optimization problem with a geometric constraint (for short, SOP). The solutions under consideration are: efficient solutions, weakly efficient solutions, strongly efficient solutions, and properly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2007
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700039290